By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

Analysis of an Infinite Product Algorithm

J. -P. Allouche, P. Hajnal, and J. O. Shallit

pp. 1-15

Intersection of Two Matroids: (Condensed) Border Graphs and Ranking

Paolo M. Camerini and Horst W. Hamacher

pp. 16-27

Codes From Symmetry Groups, and a $[32, 17, 8]$ Code

Ying Cheng and N. J. A. Sloane

pp. 28-37

Graph Bipartization and via minimization

Hyeong-Ah Choi, Kazuo Nakajima, and Chong S. Rim

pp. 38-47

Impossibility of Decomposing the Complete Graph on $n$ Points into $n - 1$ Isomorphic Complete Bipartite Graphs

D. De Caen and D. G. Hoffman

pp. 48-50

Low Rank Matrices with a Given Sign Pattern

P. Delsarte and Y. Kamp

pp. 51-63

A Note on the Vertex Arboricity of a Graph

S. L. Hakimi and E. F. Schmeichel

pp. 64-67

On the Size of Systems of Sets Every $t$ of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems

C. A. J. Hurkens and A. Schrijver

pp. 68-72

On Solving Rational Congruences

Gerhard Jaeschke

pp. 73-90

How Long Can a Euclidean Traveling Salesman Tour Be?

Howard J. Karloff

pp. 91-99

A Linear Reordering Algorithm for Parallel Pivoting of Chordal Graphs

Joseph W. H. Liu and Andranik Mirzaian

pp. 100-107

Parallel Algorithms for Zero-One Supply-Demand Problems

Noam Nisan and Danny Soroker

pp. 108-125

Optimal Algorithms for a Pursuit-Evasion Problem in Grids

Kazuo Sugihara and Ichiro Suzuki

pp. 126-143